/*
2022-2-27 
https://leetcode-cn.com/problems/minimum-number-of-steps-to-make-two-strings-anagram-ii/submissions/
*/
class Solution {
public:
    int minSteps(string s, string t) {
        vector<int> cs(26,0),ct(26,0);
        for(auto c:s)
            cs[c-'a']++;
        for(auto c:t)
            ct[c-'a']++;
        int ans=0;
        for(int i=0;i<26;i++)
            ans+=abs(cs[i]-ct[i]);
        return ans;
    }
};
